General information for Levenshtein distance for words. The data are considered as graph with words as nodes and edges weighted with Levenshtein similarity. Only the top 1.000.000 words are considered.
Number of nodes in the top-1M Levenshtein graph
Number of edges in the top-1M Levenshtein graph
Minimum word length
Edge weights in the top-1M Levenshtein graph
| Levenshtein distance |
Number of edgeses |
| 0 |
3870 |
| 1 |
16908 |
| 2 |
51140 |
134 msec needed at 2018-02-01 22:48